Dyck's map (3, 7)8 is a counterexample to a clique covering conjecture
نویسندگان
چکیده
P. Erdiis [4] communicated the conjecture that this is the only situation in which (1) holds for all edges e in G. Conjecture. If (1) holds for every edge e of a graph G, then G contains no triangle. A counterexample is given in this note. Unfortunately the origin of the conjecture is not known to us. The symbol (p, q} denotes the regular tessellation of a simply connected surface into p-gons, q incident at each 157 009%8956192 83.00
منابع مشابه
On the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کاملNice Labeling Problem for Event Structures: A Counterexample
In this paper, we present a counterexample to a conjecture of Rozoy and Thiagarajan from 1991 (also called the nice labeling problem) asserting that any (coherent) event structure with finite degree admits a labeling with a finite number of labels or, equivalently, that there exists a function f : N → N such that an event structure with degree ≤ n admits a labeling with at most f(n) labels. Our...
متن کاملBi-Covering: Covering Edges with Two Small Subsets of Vertices
We study the following basic problem called Bi-Covering. Given a graph GpV,Eq, find two (not necessarily disjoint) sets A Ď V and B Ď V such that A Y B “ V and that every edge e belongs to either the graph induced by A or to the graph induced by B. The goal is to minimize maxt|A|, |B|u. This is the most simple case of the Channel Allocation problem [13]. A solution that outputs V,H gives ratio ...
متن کاملA note on Reed's Conjecture about $\omega$, $\Delta$ and $\chi$ with respect to vertices of high degree
Reed conjectured that for every graph, χ ≤ ∆+ω+1 2 holds, where χ, ω and ∆ denote the chromatic number, clique number and maximum degree of the graph, respectively. We develop an algorithm which takes a hypothetical counterexample as input. The output discloses some hidden structures closely related to high vertex degrees. Consequently, we deduce two graph classes where Reed's Conjecture holds:...
متن کاملA note on hitting maximum and maximal cliques with a stable set
It was recently proved that any graph satisfying ω > 2 3(∆ + 1) contains a stable set hitting every maximum clique. In this note we prove that the same is true for graphs satisfying ω ≥ 23(∆ + 1) unless the graph is the strong product of an odd hole and Kω/2. We also provide a counterexample to a recent conjecture on the existence of a stable set hitting every sufficiently large maximal clique.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 54 شماره
صفحات -
تاریخ انتشار 1992